Convergence of equilibrium measures corresponding to finite subgraphs of infinite graphs: New examples
نویسندگان
چکیده
A problem from thermodynamic formalism for countable symbolic Markov chains is considered. It concerns asymptotic behavior of the equilibrium measures corresponding to increasing sequences finite submatrices an infinite nonnegative matrix A A when these converge . After reviewing results obtained up now, a solution given new class. The geometric language loaded graphs used, instead language.
منابع مشابه
No Equilibrium in Infinite Economies : Two Examples *
The purpose of this paper is to present two examples of an economy possessing an optimum but no competitive equilibrium. Their essential features are having production and preferences over an infinite horizon; in fact, it seems similar examples may not occur in overlapping generations and/or pure exchange models. There is a growing literature of equilibrium existence theorems in this field. We ...
متن کاملFinite subgraphs of uncountably chromatic graphs
It is consistent that for every function f : ω → ω there is a graph with size and chromatic number א1 in which every n-chromatic subgraph contains at least f(n) vertices (n ≥ 3). This solves a $ 250 problem of Erdős. It is consistent that there is a graph X with Chr(X) = |X| = א1 such that if Y is a graph all whose finite subgraphs occur in X then Chr(Y ) ≤ א2 (so the Taylor conjecture may fail...
متن کاملConvergence of trajectories in infinite horizon optimization
In this paper, we investigate the convergence of a sequence of minimizing trajectories in infinite horizon optimization problems. The convergence is considered in the sense of ideals and their particular case called the statistical convergence. The optimality is defined as a total cost over the infinite horizon.
متن کاملTOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...
متن کاملTheory of finite and infinite graphs
In what case do you like reading so much? What about the type of the theory of finite and infinite graphs book? The needs to read? Well, everybody has their own reason why should read some books. Mostly, it will relate to their necessity to get knowledge from the book and want to read just to get entertainment. Novels, story book, and other entertaining books become so popular this day. Besides...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Contemporary mathematics
سال: 2021
ISSN: ['2705-1056', '2705-1064']
DOI: https://doi.org/10.1090/conm/772/15487